The area-point constructal entransy dissipation rate minimization for a discrete variable cross-section conducting path

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Constructal Optimizations for Heat and Mass Transfers Based on the Entransy Dissipation Extremum Principle, Performed at the Naval University of Engineering: A Review

Combining entransy theory with constructal theory, this mini-review paper summarizes the constructal optimization work of heat conduction, convective heat transfer, and mass transfer problems during the authors’ working time in the Naval University of Engineering. The entransy dissipation extremum principle (EDEP) is applied in constructal optimizations, and this paper is divided into three par...

متن کامل

Analytical Solution for Free Vibration of a Variable Cross-Section Nonlocal Nanobeam

In this article, small scale effects on free vibration analysis of non-uniform nanobeams is discussed. Small scale effects are modelled after Eringen’s nonlocal elasticity theory while the non-uniformity is presented by exponentially varying width among the beams length with constant thickness. Analytical solution is achieved for free vibration with different boundary conditions. It is shown th...

متن کامل

A Full-Fuzzy Rate Controller for Variable Bit Rate Video

In this paper, we propose a new full-fuzzy video ratecontrol algorithm (RCA) for variable bit rate (VBR) videoapplications. The proposed RCA provides high qualitycompressed video with a low degree computational complexity.By controlling the quantization parameter (QP) on a picturebasis, it produces VBR video bit streams. The proposed RCAhas been implemented on the JM H.264/AVC video codec andth...

متن کامل

A path-following infeasible interior-point algorithm for semidefinite programming

We present a new algorithm obtained by changing the search directions in the algorithm given in [8]. This algorithm is based on a new technique for finding the search direction and the strategy of the central path. At each iteration, we use only the full Nesterov-Todd (NT)step. Moreover, we obtain the currently best known iteration bound for the infeasible interior-point algorithms with full NT...

متن کامل

BDD Path Length Minimization Based on Initial Variable Ordering

A large variety of problems in digital system design, combinational optimization and verification can be formulated in terms of operations performed on Boolean functions. The time complexity of Binary Decision Diagram (BDD) representing a Boolean function is directly related to the path length of that BDD. In this paper we present a method to generate a BDD with minimum path length. The Average...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of Low-Carbon Technologies

سال: 2012

ISSN: 1748-1317

DOI: 10.1093/ijlct/cts030